A Note on Decision Problems for Implicational Sequent Calculi
نویسنده
چکیده
We investigate cut-eliminability and decidability for implicational sequent calculi with prime contraction. The prime contraction is a restricted version of the contraction rule in LJ (the rule does not permit the contraction of implication formulas). Decision problems for the implicational sequent calculi LBB′IW (the system for the logic BB′IW) and FLc→ (the implicational fragment of the full Lambek calculus with the contraction rule) are well-known open problems. We show the partial results that the calculi with prime contraction instead of the usual contraction are decidable.
منابع مشابه
Labelled Sequent Calculi and Completeness Theorems for Implicational Relevant Logics
It is known that the implicational fragment of the relevant logic E is complete with respect to the class of Urquhart's models, where a model consists of a semilattice and a set of possible worlds. This paper shows that some implicational relevant logics, which are obtained from E by adding axioms, are complete with respect to the class of Urquhart's models with certain conditions. To show this...
متن کاملMachine - Assisted Meta - Theory of Sequent - StyleCalculi
A formalisation of the implicational fragments of two sequent calculi and a sequent-style presentation of natural deduction in Coq is presented. The systems presented are all typed lambda calculi. Based on this formalisation, some general comments on the feasibility of performing meta-theoretic proofs about typed lambda calculi in a proof assistant based on higher-order type theory are made. Co...
متن کاملA Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs
Dyckhoff and Pinto present a weakly normalising system of reductions on derivations in the cut-free intuitionistic sequent calculus, where the normal derivations are characterised as the fixed points of the composition of the Prawitz translations into natural deduction and back. This paper presents a formalisation of the system, including a proof of the weak normalisation property for the forma...
متن کاملGeneralised elimination rules and harmony
Standard natural deduction rules for Int (intuitionistic predicate logic) in the style of Gentzen and Prawitz are presumed to be familiar. The theory of cut-elimination for sequent calculus rules is very clear; whether a derivation in a sequent calculus is cut-free or not is easily defined, according to the presence or absence of instances of the Cut rule. Normality of a (natural) deduction is ...
متن کاملAn Automated Derivation of Łukasiewicz's CN Sentential Calculus from Church's P2
Two logics are implicationally equivalent if the axioms and inference rules of each imply the axioms of the other. Characterizing the implicational equivalences of various formulations of the sentential calculi is foundational to the study of logic. Using an automated deduction system, I show that Łukasiewicz's CN sentential calculus can be derived from Church's P2; the proof appears to be novel.
متن کامل